Logic programs as specifications in the inductive verification of logic programs

Logic programs as specifications in the inductive verification of logic programs

In this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. We first apply the verification framework defined in [3] to derive sufficient inductive conditions to prove partial correctness. Then we show how the resulting conditions can be proved using program transformation techniques.

The Prioritized Inductive Logic Programs

The limit behaviors of an inductive logic program should be an important research topic which has not been explored. An inductive logic program is convergent if given an increasing sequence of example sets, the inductive logic program should produce a corresponding sequence of the Horn logic programs which has the settheoretic limit; limit-correct if the limit of the produced sequence of the Ho...

Verification of Logic Programs

We present a p roof method in the style of Hoare 's logic, aimed at providing a unifying framework for the verification o f total correctness of logic and Prolog programs. The method. which relies on purely declarative reasoning, has been designed as a trade-off between expressiveness and ease of use. On the basis of a few simple principles, we reason uniformly on several properties of logic an...

Inductive Equivalence of Logic Programs

Hoare Logic, Executable Specifications and Logic Programs

Starting from Hoare correctness formulae {P} S {Q} which define first-order predicates S by their preand postconditions P and Q, I formulate logic specifications S ↔ P ∧ Q for the predicates. Subsequently, I discuss two methods to construct logic programs from logic specifications. First, I simply derive programs as the if-halves of their logic specifications. These programs are concise, readab...